Packing, Scheduling and Covering Problems in a Game-Theoretic Perspective
نویسنده
چکیده
v
منابع مشابه
Data Center Scheduling, Generalized Flows, and Submodularity
Inspired by problems in data center scheduling, we study the submodularity of certain scheduling problems as a function of the set of machine capacities and the corresponding implications. In particular, we • give a short proof that, as a function of the excess vector, maximum generalized flow is submodular and minimum cost generalized flow is supermodular; • extend Wolsey’s approximation guara...
متن کاملBin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems can be used to model task and resource allocation problems in multi-agent systems and distributed systems, and can also be found as subproblems of scheduling problems. We propose bin completion, a branch-and-bound stra...
متن کاملGame-Theoretic Approach for Pricing Decisions in Dual-Channel Supply Chain
In the current study, a dual-channel supply chain is considered containing one manufacturer and two retailers. It is assumed that the manufacturer and retailers have the same decision powers. A game-theoretic approach is developed to analyze pricing decisions under the centralized and decentralized scenarios. First, the Nash model is established to obtain the equilibrium decisions in the decent...
متن کاملAlternative Axiomatic Characterizations of the Grey Shapley Value
The Shapley value, one of the most common solution concepts of cooperative game theory is defined and axiomatically characterized in different game-theoretic models. Certainly, the Shapley value can be used in interesting sharing cost/reward problems in the Operations Research area such as connection, routing, scheduling, production and inventory situations. In this paper, we focus on the Shapl...
متن کاملAirline Crew Scheduling: a Group Theoretic Approach
The problem of airline crew scheduling is studied, the different problems composing it are formulated and solution techniques are offered. Special emphasis is given to the set covering problem appearing in the rotation selection phase. An approach is presented, based on the group theoretic method, which allows the fast solution of problems with large sizes. Thesis Supervisor: Robert W. Simpson ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1110.6407 شماره
صفحات -
تاریخ انتشار 2011